Fixed-parameter tractability for subset feedback set problems with parity constraints
نویسندگان
چکیده
منابع مشابه
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels fo...
متن کاملFixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
We investigate generalizations of the following well-known problems in the framework of parameterized complexity: the feedback set problem and the cycle packing problem. Our problem setting is that we are given a graph and a vertex set S called “terminals”. Our purpose here is to consider the following problems: 1. The feedback set problem with respect to the terminals S. We call it the subset ...
متن کاملSubset Feedback Vertex Set Is Fixed-Parameter Tractable
The classical FEEDBACK VERTEX SET problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. FEEDBACK VERTEX SET has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider...
متن کاملImproved Fixed-Parameter Algorithms for Two Feedback Set Problems
Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(c ·m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NPcomplete Edge Bipartization problem with runtime O(2 ·m).
متن کاملErdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
The well-known Erdős-Pósa theorem says that for any integer k and any graph G, either G contains k vertexdisjoint cycles or a vertex setX of order at most c·k log k (for some constant c) such that G−X is a forest. Thomassen [39] extended this result to the even cycles, but on the other hand, it is well-known that this theorem is no longer true for the odd cycles. However, Reed [31] proved that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.02.004